A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
نویسنده
چکیده
Let Γ denote a Q-polynomial distance-regular graph with diameter D ≥ 3 and standard module V . Recently Ito and Terwilliger introduced four direct sum decompositions of V ; we call these the (μ, ν)–split decompositions of V , where μ, ν ∈ {↓, ↑}. In this paper we show that the (↓, ↓)–split decomposition and the (↑, ↑)–split decomposition are dual with respect to the standard Hermitian form on V . We also show that the (↓, ↑)–split decomposition and the (↑, ↓)–split decomposition are dual with respect to the standard Hermitian form on V .
منابع مشابه
The Displacement and Split Decompositions for a Q-Polynomial Distance-regular Graph
Let Γ denote a Q-polynomial distance-regular graph with diameter at least three and standard module V . We introduce two direct sum decompositions of V . We call these the displacement decomposition for Γ and the split decomposition for Γ. We describe how these decompositions are related.
متن کاملSome matrices associated with the split decomposition for a Q-polynomial distance-regular graph
We consider a Q-polynomial distance-regular graph Γ with vertex set X and diameter D ≥ 3. For μ, ν ∈ {↓, ↑} we define a direct sum decomposition of the standard module V = CX, called the (μ, ν)–split decomposition. For this decomposition we compute the complex conjugate and transpose of the associated primitive idempotents. Now fix b, β ∈ C such that b 6= 1 and assume Γ has classical parameters...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملNonsymmetric Askey-Wilson polynomials and Q-polynomial distance-regular graphs
In his famous theorem (1982), Douglas Leonard characterized the q-Racah polynomials and their relatives in the Askey scheme from the duality property of Q-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the q-Racah polynomials in the above situation. Let Γ denote a Q-polynomial distance-regular graph that contains a Delsarte clique C. Assume ...
متن کاملThe Parameters of Bipartite Q-polynomial Distance-Regular Graphs
Let denote a bipartite distance-regular graph with diameter D ≥ 3 and valency k ≥ 3. Suppose θ0, θ1, . . . , θD is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence θi−1 − βθi + θi+1 = 0 (0 < i < D), for some real scalar β. Let q denote a complex scalar such that q + q−1 = β. Bannai and Ito have conjectured that q is real if the diameter D is suffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010